Description: 用vc编写的实现密码学中Pollard p离散对数算法的小程序。-vc prepared with the realization of cryptography which Pollard p discrete logarithm algorithm for small procedures. Platform: |
Size: 1496 |
Author:mimi |
Hits:
Description: 用vc编写的实现密码学中Pollard p离散对数算法的小程序。-vc prepared with the realization of cryptography which Pollard p discrete logarithm algorithm for small procedures. Platform: |
Size: 1024 |
Author:mimi |
Hits:
Description: ElGamal算法既能用于数据加密也能用于数字签名，其安全性依赖于计算有限域上离散对数这一难题。
密钥对产生办法。首先选择一个素数p，两个随机数, g 和x，g, x < p, 计算 y = g^x ( mod p )，则其公钥为 y, g 和p。私钥是x。g和p可由一组用户共享。
ElGamal用于数字签名。被签信息为M，首先选择一个-ElGamal algorithm not only used for data encryption can be used for digital signatures, their safety depends on the calculation of a finite field discrete logarithm this problem. Key to the method. First of all, choose a prime number p, the two random numbers, g and x, g, x <p, computing y = g ^ x (mod p), for its public key y, g and p. Private key is x. g and p by a group of users to share. ElGamal for digital signatures. Information was signed M, first choose a Platform: |
Size: 1024 |
Author:修凤志 |
Hits:
Description: 设p是素数，a是p的本原根，即a1,a2,a3,…,ap-1在mod p下产生1到p-1的所有值，所以对任何b属于{1,…,p-1},有唯一的i属于{1,…,p-1}使得ai mod p 等于p。称i为模p下以a为底b的离散对数。-P is a prime number based, a is the primitive root p, that is, a1, a2, a3, ..., ap-1 in the mod p under 1 to p-1 for all values, so for any b belongs to (1, ..., p-1), there are only i belong to (1, ..., p-1) makes ai mod p equivalent to p. Said i was under the modulus p to a for b at the end of the discrete logarithm. Platform: |
Size: 891904 |
Author:灵药 |
Hits:
Description: ElGamal算法既能用于数据加密也能用于数字签名，其安全性依赖于计算有限域上离散对数这一难题。
-ElGamal algorithm is used for both data encryption can also be used for digital signatures, their safety depends on the calculation of the discrete logarithm over finite fields this problem. Platform: |
Size: 93184 |
Author:steve |
Hits:
Description: 基于椭圆曲线离散对数问题的一次签名方案。出了一个基于椭圆曲线离散对数问题的可证安全性的一次签名方案，构造了一个椭圆曲线群上的单向
函数，给出了签名方案初始化的相关算法以及椭圆曲线群上的点加算法和倍点算法，设计了签名算法和验证算法，同时证明了签名方案的安全性．-Based on elliptic curve discrete logarithm problem in a signature scheme. Out of one based on elliptic curve discrete logarithm problem of provable security of a signature scheme, constructed on an elliptic curve group of one-way function, signature scheme is given the relevant initialization algorithm and a point on the elliptic curve group of plus fold-point algorithms and algorithms designed signature algorithm and validation algorithm, and proves the security of signature schemes. Platform: |
Size: 185344 |
Author:小玲 |
Hits:
Description: 利用VC++实现离散对数问题的一个非平凡的时间—存储平衡算法—的shanks算法。-Using VC++ to achieve the discrete logarithm problem of a non-trivial time- storage balancing algorithm- the shanks algorithm. Platform: |
Size: 9306112 |
Author:chenyujiao |
Hits:
Description: 求离散对数的shanks算法，要求如下：
实现计算 Zp 中计算离散对数的 Shanks 算法，基本要求如下：
1）p 是一个小素数( 小于 32 bit )，a 是一个本原元。程序的输入为(p, a, b), 输出为 logab ( mod p) (可以用 log3525 (mod 809)等作为测试)；
2）采用快速模指数算法求幂（如am），采用扩展欧几里得算法求逆（ 如a-i (mod p) ）；
3）采用一种好的排序算法对 L1、L2 排序；
4）采用概率算法（如Miller Rabin算法）自动生成素数 p，采用本原元的充要条件自动生成 a；-Discrete number of shanks on demand algorithm, the following: calculation of Zp calculated to achieve the discrete logarithm Shanks algorithm, the basic requirements are as follows: 1) p is a small prime number (less than 32 bit), a is a primitive element. Process input (p, a, b), output logab (mod p) (can use log3525 (mod 809) so as a test) 2) The fast mode index algorithm to solve the power (such as the am), using extended Euclidean Reed inverse algorithm (such as ai (mod p)) 3) use a good sorting algorithm on the L1, L2 sort 4) using probabilistic algorithms (such as the Miller Rabin algorithm) automatically primes p, using primitive element automatically generate the necessary and sufficient conditions a Platform: |
Size: 7559168 |
Author:vince |
Hits:
Description: Elgamal签名是基于离散对数问题的，首先选择p，g计算出B，作为公钥（p，g，B），在选择一个a作为私钥，给出明文m，对明文机型加密，计算出x，y，得到签名，接收方就可以进行验证。签名过程中必须使用Hash函数，否则的话容易受到存在性伪造攻击，并且签名长度是明文长度的二倍。
-Obtained by the Elgamal discrete logarithm problem cryptographic algorithms, first, Elgamal key generation, the machine generates a large random prime p, choose a generator g Zp Platform: |
Size: 3878912 |
Author:王风 |
Hits:
Description: DSA是基于整数有限域离散对数难题的，其安全性与RSA相比差不多。DSA的一个重要特点是两个素数公开，这样，当使用别人的p和q时，即使不知道私钥，你也能确认它们是否是随机产生的，还是作了手脚。RSA算法却作不到。-DSA is based on the integer finite field discrete logarithm problem, almost its safety compared with RSA. DSA is an important characteristic of two prime numbers is open, so, when to use someone else' s p and q, even if it does not know the private key, you can confirm whether they are randomly generated, or made the hands and feet. The RSA algorithm is less. Platform: |
Size: 15360 |
Author:李小龙 |
Hits:
Description: ElGamal算法，是一种较为常见的加密算法，它是基于1984年提出的公钥密码体制和椭圆曲线加密体系。既能用于数据加密也能用于数字签名，其安全性依赖于计算有限域上离散对数这一难题。在加密过程中，生成的密文长度是明文的两倍，且每次加密后都会在密文中生成一个随机数K。-The ElGamal algorithm is a more common encryption algorithm, which is based on the 1984 public key cryptosystem and elliptic curve cryptography system. Both digital signature can also be used for data encryption, its security relies on computational finite field discrete logarithm problem. Generated during the encryption process, the length of the ciphertext is plaintext twice, and each encryption will generate a random number K in the ciphertext. Platform: |
Size: 2048 |
Author:李小龙 |
Hits:
Description: 对椭圆曲线来说最流行的有限域是以素数为模的整数域（参见 模运算），或是特征为2的伽罗瓦域GF(2m)。后者在专门的硬件实现上计算更为有效，而前者通常在通用处理器上更为有效。专利的问题也是相关的。一些其他素数的伽罗瓦域的大小和能力也已经提出了，但被密码专家认为有一点问题。
给定一条椭圆曲线E以及一个域，我们考虑具有形式有理数点的阿贝尔群，其中x和y都在中并且定义在这条曲线上的群运算"+"（运算"+"在文章椭圆曲线中描述）。我们然后定义第二个运算"*" | Z×：如果P是上的某个点，那么我们定义等等。注意给定整数 j和k，。椭圆曲线离散对数问题（ECDLP）就是给定点P和Q，确定整数k使。 -- 一般认为在一个有限域乘法群上的离散对数问题（DLP）和椭圆曲线上的离散对数问题（ECDLP）并不等价；ECDLP比DLP要困难的多。
在密码的使用上，曲线和其中一个特定的基点G一起被选择和公布。一个私钥k被作为随机整数来选择；值被作为公钥来公布（注意假设的ECDLP困难性意味着k很难从P中确定）。-Finite field is the most popular for Elliptic Curve primes modulo integer domain (see modular arithmetic), or the characteristics of the Galois field GF (2m). Which is calculated on specialized hardware implementations more effective, while the former often are more effective in a general-purpose processor. The patent issue is also relevant. Some other primes Galois field size and capacity have been proposed, but the password experts think there is a little problem.
Given an elliptic curve E, and a domain, we consider having a form rationals point Abelian group, where x and y are in and define the group operation on this curve "+" (operation "+" in the article elliptic curve described). We then define a second operator "*" | Z ×: if P is a point on, then we define. Note that given the integers j and k. Elliptic curve discrete logarithm problem (ECDLP) is a given point P and Q, determine the integer k so.- Is generally believed that the discrete logarithm problem (DLP) Platform: |
Size: 10240 |
Author:zhangyi |
Hits:
Description: The Diffie Hellman Key Exchange Protocol and its relationship to the Elliptic Curve
Discrete Logarithm Problem Platform: |
Size: 197632 |
Author:kairazor |
Hits:
Description: ElGamal algorithm not only used for data encryption can be used for digital signatures, their safety depends on the calculation of a finite field discrete logarithm this problem. Key to the method. First of all, choose a prime number p, the two random numbers, g and x, g, x <p, computing y = g ^ x (mod p), for its public key y, g and p. Private key is x. g and p by a group of users to share. ElGamal for digital signatures. Information was signed M, first choose a Platform: |
Size: 57344 |
Author:HamzaAnwer |
Hits:
Description: ElGamal algorithm not only used for data encryption can be used for digital signatures, their safety depends on the calculation of a finite field discrete logarithm this problem. Key to the method. First of all, choose a prime number p, the two random numbers, g and x, g, x <p, computing y = g ^ x (mod p), for its public key y, g and p. Private key is x. g and p by a group of users to share. ElGamal for digital signatures. Information was signed M, first choose a Platform: |
Size: 512000 |
Author:HamzaAnwer |
Hits:
Search - discrete logarithm